All-to-all broadcast problems on Cartesian product graphs
نویسندگان
چکیده
منابع مشابه
Interleaved All-to-All Reliable Broadcast on Meshes and Hypercubes
All-to-all (ATA) reliable broadcast is the problem of reliably distributing information from every node to every other node in point-to-point interconnection networks. A good solution to this problem is essential for clock synchronization, distributed agreement, etc. We propose a novel solution in which the reliable broadcasts from individual nodes are interleaved in such a manner that no two p...
متن کاملOn General Results for All-to-All Broadcast
All-to-all broadcast refers to the process by which every node broadcasts its certain piece of information to all other nodes in the system. In this paper, we develop all-to-all broadcast schemes by dealing with two classes of schemes. A prior scheme based on generation of minimal complete sets is rst described, and then a new scheme based on propagation of experts is developed. The former alwa...
متن کاملAll-To-All Broadcast and Applications On the Connection Machine
An all{to{all broadcast algorithm that exploits concurrent communication on all channels of the Connection Machine system CM{200 binary cube network is described. Issues in integrating a physical all{to{all broadcast between processing nodes into a language environment using a global address space is dicussed. Timings for the physical broadcast between nodes, and the virtual broadcast are given...
متن کاملEfficient Data Broadcast Using One-To-All and All-To-All Broadcast Algorithm In Wireless Networks
Broadcast communication is a key requirement for WSNs Broadcast communication, which forms the basis of all communication in wireless networks. In multihop wireless networks, however, interference at a node due to simultaneous transmissions from its neighbors makes it important to design a minimumlatency broadcast algorithm, which is known to be NPcomplete. A simple 12-approximation algorithm f...
متن کاملMulti-hop all-to-all optical routings in Cartesian product networks
This paper considers the wavelength assignment problem for Cartesian product networks with multi-hops. An upper bound of the (uniform) wavelength index for Cartesian product networks with single-hop is established. This result leads to a consequence for the nth power of an arbitrary network with k-hops. In particular, if k = 1, this bound partially generalizes the results of Pankaj [R.K. Pankaj...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2015.10.002